class Solution {
public:
    int maxDotProduct(vector<int>& nums1, vector<int>& nums2) {
        int n = nums1.size(), m = nums2.size();
        vector<vector<int>> dp(n + 1, vector<int> (m + 1, INT_MIN));
        for(int i = 1; i <= n; ++i)
        {
            for(int j = 1; j <= m; ++j)
            {
                int a = max(dp[i - 1][j - 1], 0) + nums1[i - 1] * nums2[j - 1];
                int b = max({dp[i - 1][j], dp[i][j - 1], a});
                dp[i][j] = max(a, b);
            }
        }
        return dp[n][m];
    }
};
